On factor-invariant graphs with two cycles
نویسندگان
چکیده
We classify trivalent vertex-transitive graphs whose edge sets have a partition into 2-factor composed of two cycles and 1-factor that is invariant under the action automorphism group.
منابع مشابه
Notes on Cutset Conditioning on Factor Graphs with Cycles
Inference on factor graphs with loops with the standard forwardbackward algorithm, can give unpredictible results as messages can travel indefinitely in the system with no guarantee on convergence. We apply the exact method of cutset conditioning to Factor Graphs with loops starting from a fully developed three-variable example and providing comments and suggestions for distributed implementati...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملHamiltonian cycles in n-factor-critical graphs
A graph G is said to be n-factor-critical if G − S has a 1-factor for any S ⊂V (G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with 3(G)¿ 2 (p−n−1), then G is hamiltonian with some exceptions. To extend this theorem, we de6ne a (k; n)-factor-critical graph to be a graph G such that G − S has a k-factor for any S ⊂V (G) with |S| = n. We con...
متن کاملTwo-factors with few cycles in claw-free graphs
Let G be a graph of order n. De.ne fk(G) (Fk(G)) to be the minimum (maximum) number of components in a k-factor of G. For convenience, we will say that fk(G)=0 if G does not contain a k-factor. It is known that if G is a claw-free graph with su4ciently high minimum degree and proper order parity, then G contains a k-factor. In this paper we show that f2(G)6n= for n and su4ciently large and G cl...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.112937